Minimal Order Morphisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morphisms and Order Ideals of Toric Posets

Abstract: Toric posets are in some sense a natural “cyclic” version of finite posets in that they capture the fundamental features of a partial order but without the notion of minimal or maximal elements. They can be thought of combinatorially as equivalence classes of acyclic orientations under the equivalence relation generated by converting sources into sinks, or geometrically as chambers of...

متن کامل

Higher Order Singularities of Morphisms to Projective Space

This paper proves existence theorems for higher order singularities of a finite morphism to P"' and deduces a result on simple connectivity of varieties admitting a finite morphism of bounded singularity. The singularities are obtained by successive degeneration of double points of /. Our main tool is R. Schwarzenberger's notion of generalized secant sheaves and the connectedness theorem obtain...

متن کامل

Minimal Odd Order Automorphism Groups

We show that 3 is the smallest order of a non-trivial odd order group which occurs as the full automorphism group of a finite group.

متن کامل

Higher-Order Minimal Function Graphs

We present a minimal function graph semantics for a higherorder functional language with applicative evaluation order. The semantics captures the intermediate calls performed during the evaluation of a program. This information may be used in abstract interpretation as a basis for proving the soundness of program analyses. An example of this is the “closure analysis” of partial evaluation. Prog...

متن کامل

Higher-Order Minimal Functional Graphs

We present a minimal function graph semantics for a higher-order functional language with applicative evaluation order. The approach extends previous results on minimal function graphs to higher-order functions. The semantics captures the intermediate calls performed during the evaluation of a program. This information may be used in abstract interpretation as a basis for proving the soundness ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 1993

ISSN: 0022-314X

DOI: 10.1006/jnth.1993.1062